Bounds on $\lambda $ for positive solutions of $\Delta \psi +\lambda f(r)\{\psi +G(\psi )\}=0$

Hereditary Substitution for the \lambda\Delta-Calculus

Hereditary substitution is a form of type-bounded iterated substitution, first made explicit by Watkins et al. and Adams in order to show normalization of proof terms for various constructive logics. This paper is the first to apply hereditary substitution to show normalization of a type theory corresponding to a non-constructive logic, namely the λ ∆-calculus as formulated by Rehof. We show th...

Search for e(+)e(-)->Lambda(0)(b)(Lambda)over-bar(b)(0) near threshold

D. Besson, T. K. Pedlar, D. Cronin-Hennessy, K. Y. Gao, D. T. Gong, Y. Kubota, B. W. Lang, S. Z. Li, R. Poling, A. W. Scott, A. Smith, C. J. Stepaniak, S. Dobbs, Z. Metreveli, K. K. Seth, A. Tomaradze, P. Zweber, J. Ernst, A. H. Mahmood, K. Arms, K. K. Gan, H. Severini, D. M. Asner, S. A. Dytman, W. Love, S. Mehrabyan, J. A. Mueller, V. Savinov, Z. Li, A. Lopez, H. Mendez, J. Ramirez, G. S. Hua...

Performance Bounds for Lambda Policy Iteration

On the Spaces of $lambda _{r}$-almost Convergent and $lambda _{r}$-almost Bounded Sequences

The aim of the present work is to introduce the concept of $lambda _{r}$-almost convergence of sequences. We define the spaces $fleft( lambda _{r}right) $ and $f_{0}left( lambda _{r}right) $ of $ lambda _{r}$-almost convergent and $lambda _{r}$-almost null sequences. We investigate some inclusion relations concerning those spaces with examples and we determine the $beta $- and $gamma $-duals of...

Rate of Convergence and Error Bounds for LSTD($\lambda$)

We consider LSTD(λ), the least-squares temporal-difference algorithm with eligibility traces algorithm proposed by Boyan (2002). It computes a linear approximation of the value function of a fixed policy in a large Markov Decision Process. Under a β-mixing assumption, we derive, for any value of λ ∈ (0, 1), a high-probability estimate of the rate of convergence of this algorithm to its limit. W...